- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources4
- Resource Type
-
0000000004000000
- More
- Availability
-
40
- Author / Contributor
- Filter by Author / Creator
-
-
Molitor, Denali (4)
-
Needell, Deanna (2)
-
Bertozzi, Andrea L. (1)
-
Gao, Mengdi (1)
-
Ge, Yurun (1)
-
Haddock, Jamie (1)
-
Kassab, Lara (1)
-
Kryshchenko, Alona (1)
-
Lyu, Hanbaek (1)
-
Ma, Anna (1)
-
Moorman, Jacob D. (1)
-
Nguyen, Thien (1)
-
Rebrova, Elizaveta (1)
-
Sadovnik, Eli (1)
-
Vendrow, Joshua (1)
-
Will, Tyler (1)
-
Yang, Dominic (1)
-
Yuan, Jiahong (1)
-
Zhang, Runyu (1)
-
#Tyler Phillips, Kenneth E. (0)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Temporal text data, such as news articles or Twitter feeds, often comprises a mixture of long-lasting trends and transient topics. Effective topic modeling strategies should detect both types and clearly locate them in time. We first demonstrate that nonnegative CANDECOMP/PARAFAC decomposition (NCPD) can automatically identify topics of variable persistence. We then introduce sparseness-constrained NCPD (S-NCPD) and its online variant to control the duration of the detected topics more effectively and efficiently, along with theoretical analysis of the proposed algorithms. Through an extensive study on both semi-synthetic and real-world datasets, we find that our S-NCPD and its online variant can identify both short- and long-lasting temporal topics in a quantifiable and controlled manner, which traditional topic modeling methods are unable to achieve. Additionally, the online variant of S-NCPD shows a faster reduction in reconstruction error and results in more coherent topics compared to S-NCPD, thus achieving both computational efficiency and quality of the resulting topics. Our findings indicate that S-NCPD and its online variant are effective tools for detecting and controlling the duration of topics in temporal text data, providing valuable insights into both persistent and transient trends.more » « less
-
Haddock, Jamie; Will, Tyler; Vendrow, Joshua; Zhang, Runyu; Molitor, Denali; Needell, Deanna; Gao, Mengdi; Sadovnik, Eli (, Sampling Theory, Signal Processing, and Data Analysis)Abstract We introduce a new method based on nonnegative matrix factorization, Neural NMF, for detecting latent hierarchical structure in data. Datasets with hierarchical structure arise in a wide variety of fields, such as document classification, image processing, and bioinformatics. Neural NMF recursively applies NMF in layers to discover overarching topics encompassing the lower-level features. We derive a backpropagation optimization scheme that allows us to frame hierarchical NMF as a neural network. We test Neural NMF on a synthetic hierarchical dataset, the 20 Newsgroups dataset, and the MyLymeData symptoms dataset. Numerical results demonstrate that Neural NMF outperforms other hierarchical NMF methods on these data sets and offers better learned hierarchical structure and interpretability of topics.more » « less
-
Yang, Dominic; Ge, Yurun; Nguyen, Thien; Molitor, Denali; Moorman, Jacob D.; Bertozzi, Andrea L. (, IEEE Transactions on Network Science and Engineering)
-
Ma, Anna; Molitor, Denali (, ArXivorg)
An official website of the United States government
